منابع مشابه
Categoricity Without Equality
We study categoricity in power for reduced models of first order logic without equality.
متن کاملModel theory without choice? Categoricity
We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in אα for some (equivalently for every ordinal α > 0). Another central result here is, in this context: the number of models of a countable first order T of cardinality אα is either ≥ |α| for every אα or it has a small upper bound (close to i2). The author would like to ...
متن کاملModel Theory without Choice? Categoricity Sh840
We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in אα for some (equivalently for every ordinal) α > 0. Another central result here is, in this context: the number of models of a countable first order T of cardinality אα is either ≥ |α| for every α or it has a small upper bound (independent of α close to i2). The autho...
متن کاملThe Diversity of Categoricity without Delay
We suggest several new ways to compare fully primitive recursive presentations of a structure. Properties of this kind have never been seen in computable structure theory. We prove that these new definitions are nonequivalent. In this note we give only proof sketches, complete proof will appear in the full version of the paper.
متن کاملVaught's Conjecture Without Equality
Suppose σ ∈ Lω1,ω(L) is such that all equations occurring in σ are positive, have the same set of variables on each side of the equality symbol, and have at least one function symbol on each side of the equality symbol. We show that σ satisfies Vaught’s conjecture. In particular this proves Vaught’s conjecture for sentences of Lω1,ω(L) without equality.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2001
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm170-1-5